Fully Parameterizable Elliptic Curve Cryptography Processor over GF(2)
نویسندگان
چکیده
In this paper we present an Elliptic Curve Point Multiplication processor over base fields GF(2), suitable for use in a wide range of commercial cryptography applications. Our design operates in a polynomial basis is fully parameterizable in the irreducible polynomial and the chosen Elliptic Curve over any base Galois Field up to a given size. High performance is achieved by use of a dedicated Galois Field arithmetic coprocessor implemented on FPGA. The underlying FPGA architecture is used to increase calculation performance, taking advantage of the properties of this kind of programmable logic device to perform the large number of logical operations required. We discuss the performance of our processor for different Elliptic Curves and compare the results with recent implementations in terms of speed and security.
منابع مشابه
GF(2) Elliptic Curve Cryptographic Processor Architecture Based On Bit Level Pipelined Digit Serial Multiplication
New processor architecture for elliptic curve encryption is proposed in this paper. The architecture exploits projective coordinates to convert GF(2) division needed in elliptic point operations into several multiplication steps. The processor has three GF(2) multipliers implemented using bit-level pipelined digit serial computation. It is shown that this results in a faster operation than usin...
متن کاملSuperscalar Coprocessor for High-Speed Curve-Based Cryptography
We propose a superscalar coprocessor for high-speed curvebased cryptography. It accelerates scalar multiplication by exploiting instruction-level parallelism (ILP) dynamically and processing multiple instructions in parallel. The system-level architecture is designed so that the coprocessor can fully utilize the superscalar feature. The implementation results show that scalar multiplication of ...
متن کاملA Novel Elliptic curve cryptography Processor using NoC design
In this paper, we propose an elliptic curve key generation processor over GF(2) and GF(P) with Network-on-Chip (NoC) design scheme based on binary scalar multiplication algorithm. Over the Two last decades, Elliptic Curve Cryptography (ECC) has gained increasing acceptance in the industry and the academic community. This interest is mainly caused by the same level of security with relatively sm...
متن کاملEfficient FPGA Implementation of a Programmable Architecture for GF(p) Elliptic Curve Crypto Computations
This paper presents a processor architecture for elliptic curve cryptography computations over GF(p). The speed to compute the Elliptic-curve point multiplication over the prime fields GF(p) is increased by using the maximum degree of parallelism, and by carefully selecting the most appropriate coordinates system. The proposed Elliptic Curve processor is implemented using FPGAs. The time, area ...
متن کاملHardware Implementation of Elliptic Curve Point Multiplication over GF (2) for ECC protocols
The Elliptic Curve Cryptography covers all relevant asymmetric cryptographic primitives like digital signatures and key agreement algorithms. In the present work, we develop a design of elliptic curve operations over binary Fields GF (2). The function used for this purpose is the scalar multiplication kP which is the core operation of ECCs. Where k is an integer and P is a point on an elliptic ...
متن کامل